Weakly constrained codes
نویسنده
چکیده
We report on the performance of a new class of constrained codes, called weakly constrained codes. Weakly constrained codes do not strictly guarantee the imposed channel constraints but rather generate codewords that violate with given (small) probability the prescribed constraint. Weakly constrained codes are speci cally of interest when it is desirable that the code rate R = p=q is very high requiring codewords of length q > 100.
منابع مشابه
A novel design technique for weakly constrained codes
A general method of constructing (d, k) constrained codes from arbitrary sequences is introduced. This method is then used for constructing a class of weakly constrained codes. The proposed codes are analyzed for the case of d = 0 and shown to give results which are better or comparable to those of the best available codes, however at the cost of failure with some very low probability.
متن کاملDesign techniques for weakly constrained codes
A general method of constructing run-length limited ( , ) constrained codes from arbitrary sequences is introduced. This method is then combined with the method of guided scrambling for constructing a class of weakly constrained codes. The proposed codes are analyzed for the case of = 0 and are shown to give results which are better or comparable to those of the best available codes, however, a...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملMutually Uncorrelated Primers for DNA-Based Data Storage
We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNAbased data storage systems and for synchronization of communication devices. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. WMU sequences used for primer design in DNA-based data storage systems ...
متن کاملUnanimity in Attributebased Preference Domains Unanimity in Attribute-based Preference Domains
We provide several characterizations of unanimity decision rules, in a public choice model where preferences are constrained by attributes possessed by the alternatives (Nehring and Puppe, 2007a,b). Solidarity conditions require that when some parameters of the economy change, the agents whose parameters are kept fixed either all weakly lose or they all weakly win. Population-monotonicity (Thom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998